Rateless spinal codes Citation

نویسندگان

  • Jonathan Perry
  • Hari Balakrishnan
  • Devavrat Shah
چکیده

A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary with time. An ideal solution is a rateless wireless system, in which the sender encodes data without any explicit estimation or adaptation, implicitly adapting to the level of noise or interference. In this paper, we present a novel rateless code, the spinal code, which uses a hash function over the message bits to produce pseudo-random bits that in turn can be mapped directly to a dense constellation for transmission. Results from theoretical analysis and simulations show that spinal codes essentially achieve Shannon capacity, and out-perform bestknown fixed rate block codes. CATEGORIES AND SUBJECT DESCRIPTORS C.2.1 [Network Architecture and Design]: Wireless communication

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spinal codes Citation

Spinal codes are a new class of rateless codes that enable wirelessnetworks to cope with time-varying channel conditions in a naturalway, without requiring any explicit bit rate selection. The key ideain the code is the sequential application of a pseudo-random hashfunction to the message bits to produce a sequence of coded symbolsfor transmission. This encoding ensures that...

متن کامل

Integrating Spinal Codes into Wireless Systems

Rateless spinal codes [47] promise performance gains for future wireless systems. These gains can be realized in the form of higher data rates, longer operational ranges, reduced power consumption, and greater reliability. This is due in part to the manner in which rateless codes exploit the instantaneous characteristics of the wireless medium, including unpredictable fluctuations. By contrast,...

متن کامل

De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code

This paper presents an analysis of spinal codes, a class of rateless codes proposed recently [17].We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (BSC) andthe additive white Gaussian noise (AWGN) channel with an efficient polynomial-time encoder anddecoder. They are the first rateless codes with proofs of these properties for BSC and AWGN.<lb...

متن کامل

Precoded EWF codes for unequal error protection of scalable video

Rateless codes are forward error correcting (FEC) codes of linear encoding-decoding complexity and asymptotically capacity-approaching performance over erasure channels with any erasure statistics. They have been recently recognized as a simple and efficient solution for packetized video transmission over networks with packet erasures. However, to adapt the error correcting capabilities of rate...

متن کامل

Rateless and Rateless Unequal Error Protection

In this thesis we examine two different rateless codes and create a rateless unequal error protection code, all for the additive white Gaussian noise (AWGN) channel. The two rateless codes are examined through both analysis and simulation with the hope of developing a better understanding of how the codes will perform and pushing the codes further toward implementation. After analyzing and simu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011